Program Composition in Isabelle/UNITY
نویسندگان
چکیده
We describe the mechanization of recent examples of compositional reasoning, due to Charpentier and Chandy [4]. The examples illustrate a new theory for composition proposed by Chandy and Sanders [2, 3], based on the so-called existential and universal properties. We show that, while avoiding hand proof mistakes, a such compositional reasoning can be mechanized quite straightforwardly. We also present the mechanization of some theoretical results [5] concerning existential properties and their relation with the guarantees concept. The result is a new module added to the existing Isabelle/UNITY theory for composition.
منابع مشابه
Mechanising Temporal Reasoning: Summary
The project, funded by the Engineering and Physical Sciences Research Council (EPSRC), was undertaken to continue research and development involving the proof tool Isabelle. The emphasis was on temporal logics. Its results include a mechanisation of the UNITY formalism [6] and an automatic tableaux-based proof tactic, Blast tac. Both of these are distributed with Isabelle. The research assistan...
متن کاملA UNITY Mapping Operator for Distributed Programs
When describing a distributed application within the Unity framework, one usually uses the composition by union to express the interaction between processes. Unfortunately, the semantics of union is not well-suited to express the possible true parallelism between the diier-ent parts of a program. However, the diierent processes of a distributed application do not share any memory. Thanks to thi...
متن کاملCompositional Proofs of Concurrent Programs
Project GR/M75440/01, funded by the Engineering and Physical Sciences Research Council (EPSRC), was undertaken to provide a better understanding of compositional reasoning, that is, how to verify systems built from components. It is a continuation of project GR/K57381, Mechanising Temporal Reasoning. A fundamental issue is the representation of program states. The choices are between stronglyan...
متن کاملSML with antiquotations embedded into Isabelle/Isar
We report on some recent experiments with SML embedded into the Isabelle/Isar theory and proof language, such that the program text may again refer to formal logical entities via antiquotations. The meaning of our antiquotations within SML text observe the different logical environments at compile time, link time (of theory interpretations), and runtime (within proof procedures). As a general d...
متن کاملTowards a Compositional Approach to the Design and Verification of Distributed Systems
We are investigating a component-based approach for formal design of distributed systems. In this paper, we introduce the framework we use for specification, composition and communication and we apply it to an example that highlights the different aspects of a compositional design, including top-down and bottom-up phases, proofs of composition, refinement proofs, proofs of program texts, and co...
متن کامل